A Gossip Protocol for Subgroup Multicast
نویسندگان
چکیده
Gossip based multicast can be an e ective tool for providing highly reliable and scalable message dis semination Previous work has shown it to be useful in a variety of group communication settings when processes all belong to a single process group In this paper we consider the problem of gossiping within overlapping process subgroups If each subgroup independently runs the standard gossip protocol then the total gossip overhead could be high for a process that is a member of many subgroups We present a novel gossip protocol that allows individual subgroup members to trade o update quality for gossip overhead enabling processes to belong to several subgroups while maintaining a low total gossip overhead Our re sults include a mathematical model for message dissemination under this modi ed gossip protocol and an algorithm that computes gossip parameters such that all processes within a subgroup achieve their desired update quality Preliminary results are promising
منابع مشابه
Evaluation of Gossip to Build Scalable and Reliable Multicast Protocols
This paper provides an extensive experimental evaluation of the gossip technique that has been proposed to construct scalable and reliable multicast protocols. This evaluation has been done by simulating several gossip and non gossip-based multicast protocols in a network simulator NS2. The evaluation comprises of three parts: (1) a comparison of the gossip technique with other traditional mess...
متن کاملSilent Attack Hindering in Drum
Gossip based multicast is a scalable and reliable protocol for dissemination of information within a group of interconnected users. Upon receiving or producing a message the process sends (pushes) it to a small constant subset of processes which is randomly selected out of the group of members. Some implementations of gossip based multicasts poll a small subset of processes for new information,...
متن کاملAnonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks
In recent years, a number of applications of ad-hoc networks have been proposed. Many of them are based on the availability of a robust and reliable multicast protocol. In this paper, we address the issue of reliability and propose a scalable method to improve packet delivery of multicast routing protocols and decrease the variation in the number of packets received by different nodes. The prop...
متن کاملCausally Ordered Delivery Protocol for Overlapping Multicast Groups in Broker-based Sensor Networks
In sensor networks, there is a lot of overlapping multicast groups because of many subscribers, associated with their potentially varying specific interests, querying every event to sensors/publishers. Also gossip-based communication protocols are promising as one of potential solutions providing scalability in P(Publish)/ S(Subscribe) paradigm in sensor networks. Moreover, despite the importan...
متن کاملProbabilistic reliable multicast in ad hoc networks
When striving for reliability, multicast protocols are most commonly designed as deterministic solutions. Such an approach seems to make the reasoning about reliability guarantees (traditionally binary “all-ornothing”-like) in the face of packet losses and/or node crashes. It is however precisely this determinism that tends to become a limiting factor when aiming at both reliability and scalabi...
متن کامل